Solving the maximum vertex weight clique problem via binary quadratic programming
نویسندگان
چکیده
In recent years, the general binary quadratic programming (BQP) 7 model has been widely applied to solve a number of combinatorial optimiza8 tion problems. In this paper, we recast the maximum vertex weight clique 9 problem (MVWCP) into this model which is then solved by a Probabilistic 10 Tabu Search algorithm designed for the BQP. Experimental results on 80 chal11 lenging DIMACS-W and 40 BHOSLIB-W benchmark instances demonstrate 12 that this general approach is viable for solving the MVWCP problem. 13
منابع مشابه
Solving the maximum edge weight clique problem via unconstrained quadratic programming
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience reported in the literature with several problem classes has demonstrated that this approach works surprisingly well in terms of solution quality and computational times, often rivaling and sometimes surpassing more tradit...
متن کاملOptimization Algorithms for the Max Edge Weighted Clique Problem with Multiple Choice Constraints
Many relevant problems can be described and successfully solved using graphbased models. For instance, the side-chain placement problem in biology, the choice of efficient communication protocols in management science, backbone design in telecommunication networks and data mining applications share a common structure: they all require to find a maximum weighted clique in a suitable graph [1]. W...
متن کاملContinuous quadratic programming formulations of optimization problems on graphs
Four NP-hard optimization problems on graphs are studied: The vertex separator problem, the edge separator problem, the maximum clique problem, and the maximum independent set problem. We show that the vertex separator problem is equivalent to a continuous bilinear quadratic program. This continuous formulation is compared to known continuous quadratic programming formulations for the edge sepa...
متن کاملOn globally solving the maximum weighted clique problem
In this paper, we consider a combinatorial optimization problem, the Maximum Weighted Clique Problem (MWCP), a NP-hard problem. The considered problem is first formulated in the form of binary constrained quadratic program and then reformulated as a Difference Convex (DC) program. A global optimal solution is found by applying DC Algorithm (DCA) in combining with Branch and Bound scheme with SD...
متن کاملA Continuous Quadratic Programming Formulation of the Vertex Separator Problem
The Vertex Separator Problem (VSP) for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets of roughly equal size. In a recent paper (Optimality Conditions For Maximizing a Function Over a Polyhedron, Mathematical Programming, 2013, doi: 10.1007/s10107-013-0644-1), the authors announced a new continuous bilinear quadratic programmin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 32 شماره
صفحات -
تاریخ انتشار 2016